SEMINAR: Groups and Combinatorics Seminar: Vertex-primitive digraphs having vertices with almost equal neighbourhoods
|
|
| Groups and Combinatorics Seminar: Vertex-primitive digraphs having vertices with almost equal neighbourhoods |
Other events...
|
Time and place: 15:00 Friday 27 March in Weatherburn LT.
Speaker: Gabriel Verret (University of Western Australia)
Title: Vertex-primitive digraphs having vertices with almost equal neighbourhoods.
Abstract: Apart from some very trivial examples, a vertex-primitive digraph cannot have two vertices with equal neighbourhoods. (This is an easy exercise.) The first non-trivial case is thus when a vertex-primitive digraph has two vertices with neighbourhoods differing by one. I will give a proof of the classification of such digraphs, and describe a more general result and some applications.
| Contact |
Gabriel Verret
<[email protected]>
|
| Start |
Fri, 27 Mar 2015 15:00
|
| End |
Fri, 27 Mar 2015 16:00
|
| Submitted by |
Gabriel Verret <[email protected]>
|
| Last Updated |
Wed, 25 Mar 2015 09:29
|
| Included in the following Calendars: |
|
|
- Locations of venues on the Crawley and Nedlands campuses are
available via the Campus Maps website.
- Download this event as:
Text |
iCalendar
-
Mail this event:
|
